The logic of bunched implications

نویسندگان

  • Peter W. O'Hearn
  • David J. Pym
چکیده

We introduce a logic BI in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version of BI arises from an analysis of the proof-theoretic relationship between conjunction and implication; it can be viewed as a merging of intuitionistic logic and multiplicative intuitionistic linear logic. The naturality of BI can be seen categorically: models of propositional BI’s proofs are given by bicartesian doubly closed categories, i.e., categories which freely combine the semantics of propositional intuitionistic logic and propositional multiplicative intuitionistic linear logic. The predicate version of BI includes, in addition to standard additive quantifiers, multiplicative (or intensional) quantifiers ∀new and ∃new which arise from observing restrictions on structural rules on the level of terms as well as propositions. We discuss computational interpretations, based on sharing, at both the propositional and predicate levels.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic Programming with Bunched Implications (extended Abstract)

We introduce the logic of bunched implications, BI, in which multiplicative (or linear) and additive (or intuitionistic) implications live side-by-side. We provide a truth conditional semantics, a proof theory and a categorical semantics of proofs. We explain how BI arises as a logic of resources and sketch a development of this computational interpretation, which is quite diierent from that of...

متن کامل

The Inverse Method for the Logic of Bunched Implications

The inverse method, due to Maslov, is a forward theorem provingmethod for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implications (BI), due to Pym and O’Hearn, is a logic which freely combines the familiar connectives of intuitionistic logic with multiplicative linear conjunction and its adjoint implication. We present the first formulation of an inver...

متن کامل

Petri Net Semantics of Bunched Implications

Engberg and Winskel's Petri net semantics of linear logic is reconsidered , from the point of view of the logic BI of bunched implications. We rst show how BI can be used to overcome a number of diiculties pointed out by Engberg and Winskel, and we argue that it provides a more natural logic for the net semantics. We then brieey consider a more expressive logic based on an extension of BI with ...

متن کامل

Classical Logic of Bunched Implications

We consider a classical (propositional) version, CBI, of O’Hearn and Pym’s logic of bunched implications (BI) from a modeland prooftheoretic perspective. We present a class of classical models of BI which extend the usual BI-models, based on partial commutative monoids, with an algebraic notion of “resource negation”. This class of models gives rise to natural definitions of multiplicative fals...

متن کامل

Classical BI: Its Semantics and Proof Theory

We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O’Hearn and Pym’s logic of bunched implications BI. CBI differs from existing bunched logics in that its multiplicative connectives behave classically rather than intuitionistically (including in particular a multiplicative version of classical negation). At the semantic level, CBI-formulas have th...

متن کامل

Substructural modal logic for optimal resource allocation

We introduce a substructural modal logic for reasoning about (optimal) resource allocation in models of distributed systems. The underlying logic is a variant of the modal logic of bunched implications, and based on the same resource semantics, which is itself closely related to concurrent separation logic. By considering notions of cost, strategy, and utility, we are able to formulate characte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Bulletin of Symbolic Logic

دوره 5  شماره 

صفحات  -

تاریخ انتشار 1999